An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure
نویسندگان
چکیده
منابع مشابه
A Polynomial-space Exact Algorithm for Tsp in Degree-5 Graphs
The Traveling Salesman Problem (TSP) is one of the most well-known NP-hard optimization problems. Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, and thus alleviating a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in graphs with degree at most ...
متن کاملA Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs
Previously, the authors of this work have presented in a series of papers polynomial-space algorithms for the TSP in graphs with degree at most five, six and seven. Each of these algorithms is the first algorithm specialized for the TSP in graphs of limited degree five, six, and seven respectively, and the running time bound of these algorithms outperforms Gurevich and Shelah’s O∗(4nnlogn) algo...
متن کاملAn Improved Exact Algorithm for Cubic Graph TSP
It is shown that the traveling salesman problem for graphs of degree at most three with n vertices can be solved in time O(1.251), improving the previous bound O(1.260) by Eppstein.
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولAn Exact Algorithm for Maximum Independent Set in Degree-5 Graphs
The maximum independent set problem is a basic NP-hard problem and has been extensively studied in exact algorithms. The maximum independent set problems in low-degree graphs are also important and may be bottlenecks of the problem in general graphs. In this paper, we present an O∗(1.1737n)-time exact algorithm for the maximum independent set problem in an n-vertex graph with degree bounded by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-9970-4